/**
 * 
 */
package KDTreeIndex;

import java.util.ArrayList;
import java.util.TreeMap;


/**
 * @author Administrator
 *
 */
public class Node {

private int split;
private Key key;
private Node left;
private Node right;
private Node parent;
private int[] range;
private ArrayList<Key> keylist;
private TreeMap<Float,Integer> SplitList;

public Node(int Dimension)
{
	key=new Key(Dimension);
	SplitList=new TreeMap<Float,Integer>();
	range=new int[key.getDimension()*2];
	}

public Node getRight()
{
	return right;
	}

public TreeMap<Float,Integer> getSplitList()
{
	return SplitList;
}
public void setSplitList(TreeMap<Float,Integer> SplitList)
{
	this.SplitList=SplitList;
	}

 ArrayList<Key> getKeylist()
{
	return keylist;
	}
public Node getLeft()
{
	return left;
	}
public Node getParent()
{
	return parent;
	}
public int getSplit()
{
	return split;
	}

public int[] getRange()
{
	return range;
	}
public Key getKey()
{
	return key;
	}
public void setRight(Node Right)
{
	right=Right;
	}
public void setLeft(Node Left)
{
	left=Left;
	}
 void setKeylist(ArrayList<Key> keylist)
{
	this.keylist=keylist;
	}
public void setParent(Node Parent)
{
	parent=Parent;
	}
public void setSplit(int Split)
{
	split=Split;
	}
public void setRangle(int[] Range)
{
	range=Range;
	}
public void setKey(Key key)
{
	this.key=key;
	}
  void clearKeylist()
{
	this.keylist=null;
	}
}
